/*
 * Copyright (c) 2021-2022, Xilinx, Inc.
 * Copyright (c) 2022, Advanced Micro Devices, Inc.
 * All rights reserved.
 *
 * Author: Jakob Wenzel, Xilinx Research Labs.
 *
 * This file is part of RapidWright.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 */
package com.xilinx.rapidwright.placer.blockplacer;

import java.util.ArrayList;
import java.util.Collection;
import java.util.List;

import com.xilinx.rapidwright.design.AbstractModuleInst;

/**
 * Naive implementation of overlap checking. Always checks against all other instances
 */
public class ExhaustiveOverlapCache<PlacementT, ModuleInstT extends AbstractModuleInst<?,PlacementT,? super ModuleInstT>>  extends AbstractOverlapCache<PlacementT, ModuleInstT> {
    private final Collection<ModuleInstT> instances;

    public ExhaustiveOverlapCache(Collection<ModuleInstT> instances) {
        this.instances = instances;
    }

    @Override
    public void unplace(ModuleInstT mii) {
        //Everything gets recalculated, nothing to do
    }

    @Override
    public void place(ModuleInstT mii) {
        //Everything gets recalculated, nothing to do
    }

    @Override
    public boolean isValidPlacement(ModuleInstT mii) {
        return doesNotOverlapAny(mii, instances);
    }

    @Override
    public List<ModuleInstT> getAllOverlaps(ModuleInstT mii) {
        List<ModuleInstT> overlaps = new ArrayList<>();
        enterOverlaps(mii, instances, overlaps);
        return overlaps;
    }

    @Override
    public void printStats() {

    }
}
